Radial Edge Splatting for Visualizing Dynamic Directed Graphs

نویسندگان

  • Michael Burch
  • Fabian Beck
  • Daniel Weiskopf
چکیده

We describe and discuss a novel radial version of a scalable dynamic graph visualization. The radial layout encodes dynamic directed graphs on narrow rings of a circle. The temporal evolution of the graph is mapped to rings that grow outward from the center of the circle. Graph vertices are placed equidistantly at the borderlines of each ring. Graph edges are displayed as curved lines starting from a source on the inner borderline of the ring and pointing to a target on the outer borderline. To better perceive link directions and structures of large datasets, visual clutter is reduced by exploiting an edge splatting approach that generates density fields of the displayed edges. The radial layout emphasizes newer graphs, displayed in the larger, outer parts of the circle. As a benefit, edge lengths are reduced in comparison to the non-radial visualization. Moreover, the radial layout guarantees the symmetry of the visualization under shifting of vertices. We illustrate the usefulness of the diagrams by applying them to call graph data of the open source software project Cobertura.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visualizing a Sequence of a Thousand Graphs (or Even More)

The visualization of dynamic graphs demands visually encoding at least three major data dimensions: vertices, edges, and time steps. Many of the state-of-the-art techniques can show an overview of vertices and edges but lack a data-scalable visual representation of the time aspect. In this paper, we address the problem of displaying dynamic graphs with a thousand or more time steps. Our propose...

متن کامل

Visualizing Large Dynamic Digraphs

In this paper we investigate the problem of visually representing large dynamic directed graphs with many vertices, edges, and time steps. With this work we do not primarily focus on graph details but more on achieving an overview about long graph sequences with the major focus to be scalable in vertex, edge, and time dimensions. To reach this goal we first map each graph to a bipartite layout ...

متن کامل

Transparent Layering for Visualizing Dynamic Graphs Using the Flip Book Metaphor

Visualizing dynamic graphs is challenging because changing node and edge attributes as well as topological alterations need to be encoded in the visual representation. However, existing approaches such as animation, juxtaposition, and superimposition do not scale well. In this poster we propose a novel layering approach for visualizing dynamic graphs where the graph for each point in time is a ...

متن کامل

Multi-Time Scale Dynamic Graph Visualization

Dynamic graphs build complex data structures composed of vertices, edges, and time steps. Visualizing these evolving structures is a challenging task when we are not only interested in the dynamics based on a fixed time granularity, but also in exploring the subsequences at multiple of those time granularities. In this thesis, we introduce a multi-timescale dynamic graph visualization. The dyna...

متن کامل

Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts

Effective tools are crucial for visualizing large quantities of information. While developing these tools, numerous graph drawing problems emerge. We present solutions for reducing clutter in a radial visualization of a bipartite graph representing the alerts generated by an IDS protecting a computer network. Our solutions rely essentially on (i) unambiguous edge bundling to reduce the number o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012